star graph

См. также в других словарях:

• Star (graph theory) — Star The star S7. (Some authors index this as S8.) Vertices k+1 Edges k …   Wikipedia

• Star (disambiguation) — A star is a luminous cosmic body. For uses of stars as a symbol, see List of symbolic stars.Star or stars may also refer to:Places*Star Mountains, a mountain range in Papua New GuineaUnited Kingdom*Star, Anglesey, Wales *Star, Fife, Scotland… …   Wikipedia

• Star network — Star networks are one of the most common computer network topologies. In its simplest form, a star network consists of one central switch, hub or computer, which acts as a conduit to transmit messages. Thus, the hub and leaf nodes, and the… …   Wikipedia

• Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

• star — starless, adj. /stahr/, n., adj., v., starred, starring. n. 1. any of the heavenly bodies, except the moon, appearing as fixed luminous points in the sky at night. 2. Astron. any of the large, self luminous, heavenly bodies, as the sun, Polaris,… …   Universalium

• Star polygon — Set of regular star polygons {5/2} {7/2} …   Wikipedia

• Star Guitar — Infobox Single Name = Star Guitar Artist = The Chemical Brothers from Album = Come With Us Released = 2002 Format = CD, 7 Recorded = 2002 Genre = House Length = 6 mins 27 secs Label = Virgin Records Writer = ? Producer = ? [ Certification = ]… …   Wikipedia

• Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number …   Wikipedia

• Double-star snark — The Double star snark Vertices 30 Edges 45 Chromatic number …   Wikipedia

• Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia

• Threshold graph — In graph theory, a threshold graph is a graph that can be constructed from a one vertex graph by repeated applications of the following two operations: #Addition of a single isolated vertex to the graph #Addition of a single dominating vertex to… …   Wikipedia